Optimization at Container Terminals Status, Trends and Perspectives

نویسندگان

  • Ilaria Vacca
  • Michel Bierlaire
  • Matteo Salani
چکیده

International sea-freight container transportation has grown dramatically over the last years and container terminals represent nowadays a key actor in the global shipping network. Terminal managers have to face with an increasing competitiveness among terminals, which require more and more efficiency in container operations both along the quayside and within the yard: the objective is usually to minimize ship’s turnaround time, one of the main indicators of the terminal performance for the shipping companies. Moreover, the minimization of operational costs directly entails the achievement of competitive terminal fares, thus increasing the attractiveness for new customers. Operations research methods and techniques are therefore worth being used in optimizing terminal operations. In this work, we firstly give an overview of decision problems which arise in the management of a container terminal (e.g. berth allocation, quay crane scheduling, storage policies and strategies, transfer operations, ship stowage planning) and provide a review of recent papers in the OR literature. Then, starting from a collaboration with some of the busiest ports in Europe, we identify some critical issues: in particular, we discuss the impact that gate and transshipment operations have on the yard. We also focus on competition and cooperation issues among port market players and decision makers. Finally, we conclude by suggesting possible research tracks and open issues.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

Scheduling Single-Load and Multi-Load AGVs in Container Terminals

In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

A Simulation Model for Optimization of the Internal Handling Fleet Size at Shahid Rajaee Container Port Based on Performance Evaluation

The dramatic increasing of sea-freight container transportations and the developing trend for using containers in the multimodal handling systems through the sea, rail, road and land in the present market cause some challenges to the general managers of container terminals such as increasing demand, competitive situation, new investments and expansion of new activities and the need to use new m...

متن کامل

Yard crane scheduling in port container terminals using genetic algorithm

Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007